Generation of Feasible Petri Net Based Scheduling Problem Solutions
نویسندگان
چکیده
منابع مشابه
Petri net based scheduling
Timed Petri nets can be used to model and analyse scheduling problems. To support the modelling of scheduling problems, we provide a method to map tasks, resources and constraints onto a timed Petri net. By mapping scheduling problems onto Petri nets, we are able to use standard Petri net theory. In this paper we will show that we can use Petri net based tools and techniques to find conflicting...
متن کاملPetri net based dynamic scheduling of an elevator system
In this paper, a hybrid model of a multiple elevator system is proposed , consisting of a timed place Petri net (TPPN) model and a set of control rules implemented via the so-called control places in the T P P S model. The Petri net model is a highly modulized structure, whose constituent modules can be classified into three types: Basic Movement Module. Loading/Unloading Module, and Direction ...
متن کاملPetri Net Reachability Analysis meets Model-Based Diagnostic Problem Solving
| The present paper describes the formal connection between model-based diagnostic problem solving (usually performed inside logical frameworks) and Petri net reachability analysis , in case the model of the device under examination is described through a net model. We show that, by suitably re-formulating a diagnostic problem in a net-based setting, the characterization of the diagnostic proce...
متن کاملPetri Net Analysis Using Invariant Generation
Petri nets have been widely used to model and analyze concurrent systems. Their wide-spread use in this domain is, on one hand, facilitated by their simplicity and expressiveness. On the other hand, the analysis of Petri nets for questions like reachability, boundedness and deadlock freedom can be surprisingly hard. In this paper, we model Petri nets as transition systems. We exploit the specia...
متن کاملInverse feasible problem
In many infeasible linear programs it is important to construct it to a feasible problem with a minimum pa-rameters changing corresponding to a given nonnegative vector. This paper defines a new inverse problem, called “inverse feasible problem”. For a given infeasible polyhedron and an n-vector a minimum perturba-tion on the parameters can be applied and then a feasible polyhedron is concluded.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IFAC-PapersOnLine
سال: 2015
ISSN: 2405-8963
DOI: 10.1016/j.ifacol.2015.05.103